Topics in integer programming and combinatorial optimization. Formulation of models, branch-and-bound. Cutting plane and branch-and-cut algorithms. Polyhedral combinatorics. Heuristic approaches. Introduction to computational complexity.
Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request